Enumerating typical abelian prime-fold coverings of a circulant graph
نویسندگان
چکیده
منابع مشابه
Enumerating typical abelian prime-fold coverings of a circulant graph
Enumerating the isomorphism classes of several types of graph coverings is one of the central research topics in enumerative topological graph theory (see [R. Feng, J.H. Kwak, J. Kim, J. Lee, Isomorphism classes of concrete graph coverings, SIAM J. Discrete Math. 11 (1998) 265–272; R. Feng, J.H. Kwak, Typical circulant double coverings of a circulant graph, Discrete Math. 277 (2004) 73–85; R. F...
متن کاملTypical circulant double coverings of a circulant graph
Several isomorphism classes of graph coverings of a graph G have been enumerated by many authors. Kwak and Lee (Canad. J. Math. XLII (1990) 747) enumerated the isomorphism classes of graph bundles and those of n-fold coverings with respect to a group of automorphisms of the base graph G which 9x a spanning tree. Hofmeister (Discrete Math. 98 (1991) 175) independently enumerated the isomorphism ...
متن کاملa typical graph structure of a ring
the zero-divisor graph of a commutative ring r with respect to nilpotent elements is a simple undirected graph $gamma_n^*(r)$ with vertex set z_n(r)*, and two vertices x and y are adjacent if and only if xy is nilpotent and xy is nonzero, where z_n(r)={x in r: xy is nilpotent, for some y in r^*}. in this paper, we investigate the basic properties of $gamma_n^*(r)$. we discuss when it will be eu...
متن کاملEnumerating branched coverings over surfaces with boundaries
The number of nonisomorphic n-fold branched coverings over a given surface with a boundary is determined by the number of nonisomorphic n-fold graph coverings over a suitable bouquet of circles. A similar enumeration can be done for regular branched coverings. Some explicit formulae for enumerations are also obtained. © 2003 Elsevier Ltd. All rights reserved. MSC 2000: 05C10; 05C30; 57M12
متن کاملDirected prime graph of non-commutative ring
Prime graph of a ring R is a graph whose vertex set is the whole set R any any two elements $x$ and $y$ of $R$ are adjacent in the graph if and only if $xRy = 0$ or $yRx = 0$. Prime graph of a ring is denoted by $PG(R)$. Directed prime graphs for non-commutative rings and connectivity in the graph are studied in the present paper. The diameter and girth of this graph are also studied in the pa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2009
ISSN: 0012-365X
DOI: 10.1016/j.disc.2008.04.045